Suppression of sampling moire in color printing by spline-based least-squares prefiltering

نویسندگان

  • Dimitri Van De Ville
  • Wilfried Philips
  • Ignace Lemahieu
  • Rik Van de Walle
چکیده

Many image processing systems, including those for printing applications, need sampling conversions for the representation of an image from one lattice to another. For example in the case of printing, classical halftoning requires new sample values on the halftone lattice. Although often considered as a straightforward procedure, resampling can cause so-called sampling moire due to aliasing. These artifacts are often very noticeable and as such undesirable, in particular for high-quality printing. In color printing, each color separation uses its own halftone lattice. Therefore, moire patterns will not only display an unexpected new frequency and orientation, but also influence the color appearance itself. These artifacts are frequently encountered in commercial (even high-quality) printing since the interpolation algorithms used in RIPs are simple (e.g., bilinear interpolation) and do not take into account the nature of the target lattice. Approaches such as simple low-pass filtering unacceptably blur the edges, while manual selective smoothing by an operator is very time-consuming. This paper proposes an optimal prefilter which is based on the least-squares linear resampling paradigm. Our approach requires proper discrete/continuous models, i.e., for both the source and the target lattices, and computes the associated reconstruction function which minimizes the error between the representations in the continuous domain. The reconstruction function jointly takes into account the Nyquist areas of every color separation using a novel hexagonal spline model resulting into an optimal prefilter before halftoning. Experimental results show that after prefiltering, the images are much less prone to moire while not suffering from noticeable edge blurring. 2002 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least-squares spline resampling to a hexagonal lattice

Resampling is a common operation in digital image processing systems. The standard procedure involves the (conceptual) reconstruction of a continuous image succeeded by sampling on the new lattice sites. When the reconstruction is done by classical interpolation functions, results might be sub-optimal because the information loss is not minimized. In the particular case of subsampling (i.e., re...

متن کامل

A New Technique for Image Zooming Based on the Moving Least Squares

In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...

متن کامل

Image resampling between orthogonal and hexagonal lattices

Resampling techniques are commonly required in digital image processing systems. Many times the classical interpolation functions are used, i.e., nearest-neighbour interpolation and bilinear interpolation, which are prone to the introduction of undesirable artifacts due to aliasing such as moire patterns. This paper presents a novel approach which minimizes the loss of information, in a least-s...

متن کامل

Robust Stabilization of Tone Reproduction Curves for the Xerographic Process

The stabilization of a single color tone reproduction curve (TRC) is critical for high delity color printing. A TRC controller uses a small number of actua-tors and a small number of measurements to stabilize the potentially high dimensional TRC. The overall least squares deviation of the TRC from the ideal nominal TRC is minimized in the face of the many disturbances and uncertainty in the sys...

متن کامل

Adaptive Smooth Scattered Data Approximation for Large-scale Terrain Visualization

We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement and produces smooth surfaces. It combines adaptive clustering based on quadtrees with piecewise polynomial least squares approximations. The resulting surface components are locally approximated by a smooth B-spline surfa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2003